A Hybrid Genetic Algorithm for Structural Optimization Problems

نویسندگان

  • Mohammad G. Sahab
  • Vassili V. Toropov
  • William Lyons
  • Ashraf F. Ashour
چکیده

This paper presents a hybrid optimization algorithm based on a modified genetic algorithm (GA). The algorithm includes two stages. In the first stage, a global search is carried out over the design search space using a modified GA. In the second stage, a local search is executed that is based on GA solution using a discretized form of Hooke and Jeeves method. The modifications on basic GA includes dynamically changing the population size throughout the GA process, utilizing variable penalty multiplier and the use of a square root form of the penalty function in constraint handling. The hybrid algorithm and the modifications to the basic GA are examined on the design optimization of a well-known test problem (10 bar truss). The effect of different parameters and techniques of handling GA operators on the performance of the proposed algorithm is investigated. The hybrid algorithm is employed for the design optimization of a reinforced concrete flat slab building and the results are compared with those of using the GA only.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION

In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...

متن کامل

A Hybrid Particle Swarm Optimization and Genetic Algorithm for Truss Structures with Discrete Variables

A new hybrid algorithm of Particle Swarm Optimization and Genetic Algorithm (PSOGA) is presented to get the optimum design of truss structures with discrete design variables. The objective function chosen in this paper is the total weight of the truss structure, which depends on upper and lower bounds in the form of stress and displacement limits. The Particle Swarm Optimization basically model...

متن کامل

An Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...

متن کامل

HYBRID COLLIDING BODIES OPTIMIZATION AND SINE COSINE ALGORITHM FOR OPTIMUM DESIGN OF STRUCTURES

Colliding Bodies Optimization (CBO) is a population-based metaheuristic algorithm that complies physics laws of momentum and energy. Due to the stagnation susceptibility of CBO by premature convergence and falling into local optima, some meritorious methodologies based on Sine Cosine Algorithm and a mutation operator were considered to mitigate the shortcomings mentioned earlier. Sine Cosine Al...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems

In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006